convolut neural network human action recognit fulli autom recognit action uncontrol environ exist work reli domain knowledg construct complex handcraft featur input addit environ assum control convolut neural network cnn type deep model act directli raw input autom process featur construct model limit handl input paper develop cnn model action recognit model extract featur spatial tempor dimens perform convolut captur motion inform encod multipl adjac frame develop model gener multipl channel inform input frame final featur represent obtain combin inform channel appli develop model recogn human action real world environ achiev superior perform reli handcraft featur share dsubspac learn framework multi dlabel classif multi label problem aris domain multi topic document categor protein function predict automat imag annot natur deal problem construct binari classifi label result set independ binari classif problem multipl label share input space semant convei label correl essenti exploit correl inform contain label paper gener framework extract share structur multi label classif framework common subspac assum share multipl label show optim solut propos formul obtain solv gener eigenvalu problem problem nonconvex high dimension problem direct comput solut expens develop effici algorithm case appeal featur propos framework includ algorithm special case elucid intrins relationship show propos framework extend kernel induc featur space conduct extens experi multi topic web page categor automat gene express pattern imag annot task result demonstr acceler gradient method trace norm minim minim smooth loss function regular trace norm matrix variabl formul find applic machin learn task includ multi task learn matrix classif matrix complet standard semidefinit program formul problem computation expens addit due smooth natur trace norm optim order black box method solv class problem converg iter counter paper exploit special structur trace norm base propos extend gradient algorithm converg propos acceler gradient algorithm achiev optim converg rate smooth problem experi multi task learn problem demonstr effici propos algorithm squar formul class gener eigenvalu problem machin learn machin learn algorithm formul gener eigenvalu problem major limit formul gener eigenvalu problem computation expens solv larg scale problem paper show mild condit class gener eigenvalu problem machin learn formul squar problem class problem includ classic techniqu acceler gradient method trace norm minim minim smooth loss function regular trace norm matrix variabl formul find applic machin learn task includ multi task learn matrix classif matrix complet standard semidefinit program formul problem computation expens addit due smooth natur trace norm optim order black box method solv class problem converg iter counter paper exploit special structur trace norm base propos extend gradient algorithm converg propos acceler gradient algorithm achiev optim converg rate smooth problem experi multi task learn problem demonstr effici propos algorithm linear dimension reduct multi dlabel classif dimension reduct essenti step high dimension data analysi dimension reduct algorithm appli successfulli multi class multi label problem commonli appli separ data preprocess step classif algorithm paper studi joint learn framework perform dimension reduct multi label classif simultan show squar loss classif joint learn decoupl separ compon dimension reduct multi label classif analysi partial justifi current practic separ applic dimension reduct classif problem extend analysi loss function includ hing loss squar hing loss extend formul gener case input data class label differ overcom limit tradit dimension reduct algorithm experi benchmark data set conduct evalu propos joint formul linear dimension reduct multi dlabel classif dimension reduct essenti step high dimension data analysi dimension reduct algorithm appli successfulli multi class multi label problem commonli appli separ data preprocess step classif algorithm paper studi joint learn framework perform dimension reduct multi label classif simultan show squar loss classif joint learn decoupl separ compon dimension reduct multi label classif analysi partial justifi current practic separ applic dimension reduct classif problem extend analysi loss function includ hing loss squar hing loss extend formul gener case input data class label differ overcom limit tradit dimension reduct algorithm experi benchmark data set conduct evalu propos joint formul drosophilagen express pattern annot multi dinstanc multi dlabel learn berkelei drosophila genom project bdgp produc larg number gene express pattern annot textual anatom development term term spatial correspond local region imag attach collect group imag unknown term assign region imag group pose challeng develop comput method autom textual descript express pattern contain imag paper show underli natur task match machin learn framework multi instanc multi label learn miml propos miml support vector machin solv problem beset annot task empir studi show propos method outperform state art drosophila gene express pattern annot method drosophila gene express pattern annot spars featur term dterm interact mine discret pattern binari matrix factor mine discret pattern binari data import subsampl compress cluster rankon binari matrix approxim identifi domin pattern data preserv discret properti approxim data minimum set inconsist entri mismatch binari data approxim matrix due hard problem previou account problem emploi heurist result approxim optim paper show rank binari matrix approxim reformul integ linear program ilp ilp formul computation expens small size matric propos linear program lp relax shown achiev guarante approxim error bound extend propos formul regular techniqu commonli emploi address overfit lp formul restrict medium size matric due larg number variabl involv larg matric interestingli show propos approxim formul transform instanc minimum cut problem solv effici find maximum flow empir studi show effici propos algorithm base maximum flow result confirm establish theoret bound unifi framework gener linear discrimin analysi linear discrimin analysi lda wellknown method supervis dimension reduct year lda base algorithm develop cope curs dimension essenc algorithm emploi techniqu deal singular problem occur data dimension larger sampl size appli successfulli applic lack systemat studi common differ algorithm intrins relationship paper unifi framework gener lda propos transfer function propos framework elucid properti algorithm relationship base present analysi propos effici model select algorithm lda conduct extens experi collect high dimension data includ text document face imag gene express data gene express pattern imag evalu propos theori algorithm squar formul canon correl analysi canon correl analysi cca techniqu find correl set multi dimension variabl project set variabl lower dimension space maxim correl cca commonli appli supervis dimension reduct multi dimension variabl deriv class label shown cca formul squar problem binaryclass case relationship gener set remain unclear paper show mild condit hold high dimension data cca multi label classif formul squar problem base equival relationship propos cca extens includ spars cca norm regular experi multi label data set confirm establish equival relationship result demonstr effect propos cca extens learn subspac kernel classif kernel method appli successfulli data mine task subspac kernel learn recent propos discov effect low dimension subspac kernel featur space improv classif paper propos construct subspac kernel hilbert schmidt independ criterion hsic show optim subspac kernel obtain effici solv eigenvalu problem limit exist subspac kernel learn formul kernel learn classif independ subspac kernel optim adapt classif overcom limit propos joint optim framework learn subspac kernel subsequ classifi simultan addit propos learn formul extract uncorrel subspac kernel reduc redund inform subspac kernel idea multipl kernel learn extend propos formul case multipl kernel combin show integr subspac kernel formul semidefinit program sdp computation expens improv effici sdp formul propos equival semi infinit linear program silp formul solv effici column gener techniqu experiment result collect benchmark data set demonstr effect propos algorithm extract share subspac multi dlabel classif multi label problem aris domain multitop document categor protein function predict natur deal problem construct binari classifi label result set independ binari classif problem multipl label share input space semant convei label correl essenti exploit correl inform contain label paper gener framework extract share structur multi label classif framework common subspac assum share multipl label show optim solut propos formul obtain solv gener eigenvalu problem problem nonconvex high dimension problem direct comput solut expens develop effici algorithm case appeal featur propos framework includ algorithm special case elucid intrins relationship conduct extens experi eleven multitop web page categor task result demonstr effect propos formul comparison repres algorithm hypergraph spectral learn multi dlabel classif hypergraph gener tradit graph edg arbitrari empti subset vertex set appli successfulli captur highord relat domain paper propos hypergraph spectral learn formul multi label classif hypergraph construct exploit correl inform label show propos formul lead eigenvalu problem computation expens larg scale problem reduc comput cost propos approxim formul shown equival squar problem mild condit base approxim formul effici algorithm solv squar problem appli scale formul larg data set addit exist regular techniqu squar incorpor model improv gener perform conduct experi largescal benchmark data set experiment result show propos hypergraph spectral learn formul effect captur high order relat multilabel problem result approxim formul effici origin keep competit classif perform multi dlabel multipl kernel learn present multi label multipl kernel learn mkl formul data embed low dimension space direct instancelabel correl encod hypergraph formul problem kernel induc featur space propos learn kernel matrix linear combin collect kernel matric mkl framework propos learn formul lead smooth min max problem cast semi infinit linear program silp propos approxim formul guarante error bound involv unconstrain convex optim problem addit show object function approxim formul differenti lipschitz continu gradient exist method emploi comput optim solut effici appli propos formul autom annot drosophila gene express pattern imag promis result report comparison repres algorithm multi dlabel multipl kernel learn present multi label multipl kernel learn mkl formul data embed low dimension space direct instancelabel correl encod hypergraph formul problem kernel induc featur space propos learn kernel matrix linear combin collect kernel matric mkl framework propos learn formul lead smooth min max problem cast semi infinit linear program silp propos approxim formul guarante error bound involv unconstrain convex optim problem addit show object function approxim formul differenti lipschitz continu gradient exist method emploi comput optim solut effici appli propos formul autom annot drosophila gene express pattern imag promis result report comparison repres algorithm adapt diffus kernel learn biolog network protein function predict autom annot drosophila gene express pattern control vocabulari kernel uncorrel regular discrimin analysi theoret comput studi gener linear discrimin analysi unifi framework effici model select multi dclass discrimin kernel learn convex program regular kernel discrimin analysi rkda perform linear discrimin analysi featur space kernel trick perform depend select kernel paper problem multipl kernel learn mkl rkda optim kernel matrix obtain linear combin pre kernel matric show kernel learn problem rkda formul convex program show problem formul semidefinit program sdp base equival relationship rkda squar problem binari class case propos convex quadrat constrain quadrat program qcqp formul kernel learn rkda semi infinit linear program silp formul deriv improv effici extend formul multi class case base kei result establish paper multi class rkda kernel learn problem decompos set binari class kernel learn problem constrain share common kernel base decomposit properti sdp formul propos multi class case lead natur qcqp silp formul perform rkda depend regular paramet show paramet optim joint framework kernel extens experi conduct analyz connect algorithm discuss discrimin kernel regular paramet learn semidefinit program regular kernel discrimin analysi rkda perform linear discrimin analysi featur space kernel trick perform rkda depend select kernel paper problem learn optim kernel convex set kernel show kernel learn problem formul semidefinit program sdp binari class case extend sdp formul multi class case base kei result establish paper multi class kernel learn problem decompos set binari class kernel learn problem addit propos approxim scheme reduc comput complex multi class sdp formul perform rkda depend regular paramet show learn automat framework experiment result benchmark data set demonstr efficaci propos sdp formul learn kernel matrix discrimin analysi quadrat constrain quadrat program kernel function plai central role kernel method paper autom learn kernel matrix convex combin pre kernel matric regular kernel discrimin analysi rkda perform linear discrimin analysi featur space kernel trick previou studi shown kernel learn problem formul semidefinit program sdp computation expens recent advanc interior point method base equival relationship rkda squar problem binari class case propos quadrat constrain quadrat program qcqp formul kernel learn problem solv effici sdp exist work kernel learn deal binari class problem show qcqp formul extend natur multi class case experiment result binari class multiclass benchmark data set show efficaci propos qcqp formul 